Quantum phase estimation for a class of generalized eigenvalue problems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems

In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.

متن کامل

Fast Condition Estimation for a Class of Structured Eigenvalue Problems

We present a fast condition estimation algorithm for the eigenvalues of a class of structured matrices. These matrices are low rank modifications to Hermitian, skew-Hermitian, and unitary matrices. Fast structured operations for these matrices are presented, including Schur decomposition, eigenvalue block swapping, matrix equation solving, compact structure reconstruction, etc. Compact semisepa...

متن کامل

a new inexact inverse subspace iteration for generalized eigenvalue problems

in this paper, we represent an inexact inverse subspace iteration method for com- puting a few eigenpairs of the generalized eigenvalue problem ax = bx[q. ye and p. zhang, inexact inverse subspace iteration for generalized eigenvalue problems, linear algebra and its application, 434 (2011) 1697-1715 ]. in particular, the linear convergence property of the inverse subspace iteration is preserved.

متن کامل

A generalized implicit enumeration algorithm for a class of integer nonlinear programming problems

Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...

متن کامل

A projection method for generalized eigenvalue problems

In this paper, we propose a method for finding certain eigenvalues of a generalized eigenvalue problem that lie in a given domain of the complex plane. The proposed method projects the matrix pencil onto a subspace associated with the eigenvalues that are located in the domain via numerical integration. The projection produces a small pencil with Hankel matrices.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review A

سال: 2020

ISSN: 2469-9926,2469-9934

DOI: 10.1103/physreva.102.022422